A Branch-and-Price Graph-Theoretical Algorithm for Orthogonal-Packing Feasibility
نویسندگان
چکیده
Contents 1. Introduction 1 1.1. Formulations and exact methods for OPP 1 1.2. Relaxations and bounds 2 1.3. Our contributions 2 2. The interval-graph model and a simplification 3 Discussion 4 3. An overview of the algorithm of Fekete and Schepers 4 3.
منابع مشابه
A Comparative Study of Exact Algorithms for the Two Dimensional Strip Packing Problem
In this paper we consider a two dimensional strip packing problem. The problem consists of packing a set of rectangular items in one strip of width W and infinite height. They must be packed without overlapping, parallel to the edge of the strip and we assume that the items are oriented, i.e. they cannot be rotated. To solve this problem, we use three exact methods: a branch and bound method, a...
متن کاملBin Packing with Conflicts: A Generic Branch-and-Price Algorithm
The bin packing problem with conflicts consists in packing items in a minimum number of bins of limited capacity while avoiding joint assignments of items that are in conflict. Our study demonstrates the comparatively good performance of a generic Branch-and-Price algorithm for this problem. We made use of our black-box solver BaPCod, relying on its generic branching scheme and primal heuristic...
متن کاملA Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
Higher-dimensional orthogonal packing problems have a wide range of practical applications, including packing, cutting, and scheduling. Previous efforts for exact algorithms have been unable to avoid structural problems that appear for instances in twoor higher-dimensional space. We present a new approach for modeling packings, using a graph-theoretical characterization of feasible packings. Ou...
متن کاملLP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
We consider the feasibility problem OPP in higher-dimensional orthogonal packing: given a set of d-dimensional (d ≥ 2) rectangular items, decide whether all of them can be orthogonally packed in the given rectangular container without rotation. The 1D ‘bar’ LP relaxation of OPP reduces the latter to a 1D cutting-stock problem where the packing of each stock bar represents a possible 1D stitch t...
متن کاملAn Interval Graph-based Tabu Search Framework for Multi-dimensional Packing
Packing is a vast and continuously growing field in the area of Operations Research and Combinatorial Optimization. Roughly speaking, given a set of items and a set of containers, packing problems are concerned with the loading of the items into the containers, according to some packing rules and optimizing a performance measure. Under this broad definition, we find a wide set of real-life and ...
متن کامل